Multishape Task Scheduling Algorithm for Real Time Micro-Controller Based Application
نویسندگان
چکیده
منابع مشابه
A Power-Aware, Best-Effort Real-Time Task Scheduling Algorithm
In this paper, we present a power-aware, besteffort real-time task scheduling algorithm called PA-BTA that optimizes real-time performance and power consumption. The algorithm considers a timeliness model where task timing constraints are described using Jensen’s benefit functions and a system-level power model. We propose a metric called “Energy and Real-Time Performance Grade” (ERG) to measur...
متن کاملDynamic Real - Time Task Scheduling
Multiprocesssor systems have emerged as an important computing means for real-time applications and have received increasing attention than before. However, until now, little research has been done on the problem of on-line scheduling of parallel tasks with deadlines in partitionable multiprocessor systems. Meshes and hypercubes belong to this class of multiprocessors. In this paper, we propose...
متن کاملA Profile-Based Energy-Efficient Intra-Task Voltage Scheduling Algorithm for Hard Real-Time Applications
Intra-task voltage scheduling (IntraVS), which adjusts the supply voltage within an individual task boundary, is an effective technique for developing low-power applications. In this paper, we propose a novel intra-task voltage scheduling algorithm for hard real-time applications based on average-case execution information. Unlike the original IntraVS algorithm where voltage scaling decisions a...
متن کاملThe Distributed Task Scheduling Based on Real- coded Immune Algorithm
Task scheduling is a NP puzzle. Its algorithm is an important research direction. This paper proposes a task scheduling algorithm based on real-coded immune algorithm by studying and analyzing task scheduling models and immune algorithms existed. This paper discusses the coding method, the generation and update of population, the update of memory cells and the values of partial parameters. This...
متن کاملA Priority-Based Scheduling Algorithm for Real-Time Databases
Database systems for real-time applications must satisfy timing constraints associated with transactions, in addition to maintaining the consistency of data. In this paper we propose a priority-based scheduling algorithm for real-time database systems. We show that this algorithm is deadlock-free, and in addition, a high priority transaction is not blocked by uncommitted lower priority transact...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2017
ISSN: 1556-5068
DOI: 10.2139/ssrn.3642476